The Decision Diie-hellman Problem
نویسنده
چکیده
The Decision Diie-Hellman assumption (ddh) is a gold mine. It enables one to construct eecient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.
منابع مشابه
Diie-hellman Key Distribution Extended to Group Communication
Ever since 2-party Diie-Hellman key exchange was rst proposed in 1976, there have been eeorts to extend its simplicity and elegance to a group setting. Notable solutions have been proposed by Ingemarsson et al. (in 1982) and Burmester/Desmedt (in 1994). In this paper, we consider a class of protocols that we call natural extensions of Diie-Hellman to the n-party case. After demonstrating the se...
متن کاملPolynomial Interpolation of Cryptographic Functions Related to the Diie-hellman Problem
Recently, the rst author introduced some cryptographic functions closely related to the Diie-Hellman problem called P-Diie-Hellman functions. We show that the existence of a low degree polynomial representing a P-Diie-Hellman function on a large set would lead to an eecient algorithm for solving the Diie-Hellman problem. Motivated by this result we prove lower bounds on the degree of such inter...
متن کاملThe Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Both uniform and non-uniform results concerning the security of the Diie-Hellman key-exchange protocol are proved. First, it is shown that in a cyclic group G of order jGj = Q p ei i , where all the multiple prime factors of jGj are polynomial in log jGj, there exists an algorithm that reduces the computation of discrete logarithms in G to breaking the Diie-Hellman protocol in G and has complex...
متن کاملThe Relationship between Breaking the Diie-hellman Protocol and Computing Discrete Logarithms
Both uniform and non-uniform results concerning the security of the Diie-Hellman key-exchange protocol are proved. First, it is shown that in a cyclic group G of order jGj = Q p ei i , where all the multiple prime factors of jGj are polynomial in log jGj, there exists an algorithm that reduces the computation of discrete logarithms in G to breaking the Diie-Hellman protocol in G and has complex...
متن کاملA Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function
Given a cyclic group G and a generator g, the Diie-Hellman function (DH) maps two group elements (g a ; g b) to g ab. For many groups G this function is assumed to be hard to compute. We generalize this function to the P-Diie-Hellman function (P-DH) that maps two group elements (g a ; g b) to g P (a;b) for a (non-linear) polynomial P in a and b. In this paper we show that computing DH is comput...
متن کامل